Congruence of matrix spaces, matrix tuples, and multilinear maps
نویسندگان
چکیده
Two matrix vector spaces V,W⊂Cn×n are said to be equivalent if SVR=W for some nonsingular S and R. These congruent R=ST. We prove that all matrices in V W symmetric, or skew-symmetric, then only they equivalent. Let F:U×…×U→V G:U′×…×U′→V′ symmetric skew-symmetric k-linear maps over C. If there exists a set of linear bijections φ1,…,φk:U→U′ ψ:V→V′ transforms F G, such with φ1=…=φk.
منابع مشابه
Multilinear Maps Using Random Matrix
Garg, Gentry and Halevi (GGH) described the first candidate multilinear maps using ideal lattices. However, Hu and Jia presented an efficient attack on GGH map, which breaks the GGH-based applications of multipartite key exchange (MPKE) and witness encryption (WE) based on the hardness of 3-exact cover problem. We describe a new construction of multilinear map using random matrix, which support...
متن کاملFunction spaces of Rees matrix semigroups
We characterize function spaces of Rees matrixsemigroups. Then we study these spaces by using the topologicaltensor product technique.
متن کاملCongruence of Multilinear Forms
Let F : U × · · · × U → K, G : V × · · · × V → K be two n-linear forms with n > 2 on vector spaces U and V over a field K. We say that F and G are symmetrically equivalent if there exist linear bijections φ1, . . . , φn : U → V such that F (u1, . . . , un) = G(φi1u1, . . . , φinun) for all u1, . . . , un ∈ U and each reordering i1, . . . , in of 1, . . . , n. The forms are said to be congruent ...
متن کاملCanonical forms for complex matrix congruence and *congruence
Canonical forms for congruence and *congruence of square complex matrices were given by Horn and Sergeichuk in [Linear Algebra Appl. 389 (2004) 347–353], based on Sergeichuk’s paper [Math. USSR, Izvestiya 31 (3) (1988) 481–501], which employed the theory of representations of quivers with involution. We use standard methods of matrix analysis to prove directly that these forms are canonical. Ou...
متن کاملPrivate Outsourcing of Polynomial Evaluation and Matrix Multiplication Using Multilinear Maps
Verifiable computation (VC) allows a computationally weak client to outsource the evaluation of a function on many inputs to a powerful but untrusted server. The client invests a large amount of off-line computation and gives an encoding of its function to the server. The server returns both an evaluation of the function on the client’s input and a proof such that the client can verify the eval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2020.09.018